On Classi cation and Regression
نویسنده
چکیده
We address the problem of computing various types of expressive tests for decision tress and regression trees. Using expressive tests is promising, because it may improve the prediction accuracy of trees. The drawback is that computing an optimal test could be costly. We present a uni ed framework to approach this problem, and we revisit the design of e cient algorithms for computing important special cases. We also prove that it is intractable to compute an optimal conjunction or disjunction.
منابع مشابه
Feature Selection and Dualities in Maximum Entropy Discrimination
Incorporating feature selection into a classi cation or regression method often carries a number of advantages. In this paper we formalize feature selection speci cally from a discriminative perspective of improving classi cation/regression accuracy. The feature selection method is developed as an extension to the recently proposed maximum entropy discrimination (MED) framework. We describe MED...
متن کاملLogistic Regression in Datastreams
Learning from data streams is a well researched task both in theory and practice. As remarked by Clarkson, Hazan and Woodru [12], many classi cation problems cannot be very well solved in a streaming setting. For previous model assumptions, there exist simple, yet highly arti cial lower bounds prohibiting space e cient onepass algorithms. At the same time, several classi cation algorithms are o...
متن کاملClustering financial time series: an application to mutual funds style analysis
Classi#cation can be useful in giving a synthetic and informative description of contexts characterized by high degrees of complexity. Di3erent approaches could be adopted to tackle the classi#cation problem: statistical tools may contribute to increase the degree of con#dence in the classi#cation scheme. A classi#cation algorithm for mutual funds style analysis is proposed, which combines di3e...
متن کاملClassi cation using Bayesian Neural Nets
Recently, Bayesian methods have been proposed for neural networks to solve regression and classi cation problems. These methods claim to overcome some di culties encountered in the standard approach such as over tting. However, an implementation of the full Bayesian approach to neural networks as suggested in the literature applied to classi cation problems is not easy. In fact we are not aware...
متن کاملCombining weak learners with probabilistic models for binary classication
In this project it is addressed the problem of binary classi cation i.e. we want to nd a model F : X! f0; 1g for the dependence of a class c on x from a set of samples D = fct;xtgt=1 with ct 2 f0; 1g. The approach is to combine multiple base learners with the use of probabilistic models. In particular, I used the methodology presented by Ghersen eld for doing regression in complex time series[...
متن کاملComparison of Neural and Statistical Classiiers| Theory and Practice
Pattern classi cation using neural networks and statistical methods is discussed. We rst give a tutorial overview that groups popular classi ers according to their underlying mathematical principles into several distinct categories. Starting from the Bayes classi er, one division is whether the classi er is explicitly estimating class conditional densities, or directly estimating the posterior ...
متن کامل